#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;

class Solution{
    public:
    int ans1(vector<vector<int>>& grid){
        int m = grid.size(), n = grid[0].size();
        if(n == 0){
            return 0;
        }
        vector<vector<int>>dp(m, vector<int>(n));
        dp[0][0] = grid[0][0];
        for(int i = 0; i != m; i++){
            for(int j = 0; j != n; j++){
                if(j > 0 && i == 0){
                    dp[i][j] = dp[i][j-1] + grid[i][j];
                }else if(i > 0 && j == 0){
                    dp[i][j] = dp[i-1][j] + grid[i][j];
                }else if(i > 0 && j > 0){
                    dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
                }
            }
        }
        return dp[m-1][n-1];
    }
};

void test(){
    Solution s;
    vector<vector<int>> grid = {
        {1,3,1},
        {1,5,1},
        {4,2,1}
    };

    int ret = s.ans1(grid);
    cout << ret << endl;
}

int main(void){
    test();

    return 0;
}